منابع مشابه
Non-convex polyhedral volume of interest selection
We introduce a novel approach to specify and edit volumes of interest (VOI for short) interactively. Enhancing the capabilities of standard systems we provide tools to edit the VOI by defining a not necessarily convex polyhedral bounding object. We suggest to use low-level editing interactions for moving, inserting and deleting vertices, edges and faces of the polyhedron. The low-level operatio...
متن کاملGeodesic Flow on Polyhedral Surfaces
On a curved surface the front of a point wave evolves in concentric circles which start to overlap and branch after a certain time. This evolution is described by the geodesic ow and helps us to understand the geometry of surfaces. In this paper we compute the evolution of distance circles on polyhedral surfaces and develop a method to visualize the set of circles, their overlapping, branching,...
متن کاملGeodesic Spanners on Polyhedral Surfaces
In this paper we consider the problem of efficiently constructing geodesic t-spanners. We consider finding spanners on the surface of a 3 dimensional polyhedron. If Steiner vertices are allowed on the surface of the polyhedron, then we are able to construct sparse t-spanners. If no Steiner vertices are allowed, then we establish lower bounds on the maximum node degree, depending on the spanning...
متن کاملPolyhedral studies on the convex recoloring
A coloring of the vertices of a graph G is convex if, for each assigned color d, the vertices with color d induce a connected subgraph of G. We address the convex recoloring problem, defined as follows. Given a graph G and a coloring of its vertices, recolor a minimum number of vertices of G, so that the resulting coloring is convex. This problem is known to be NP-hard even when G is a path. We...
متن کاملA non-parametric heuristic algorithm for convex and non-convex data clustering based on equipotential surfaces
0957-4174/$ see front matter 2009 Elsevier Ltd. A doi:10.1016/j.eswa.2009.10.019 * Corresponding author. Tel.: +98 2177240487; fax E-mail addresses: [email protected] (F. Bayat), eade [email protected] (A.A. Jalali), [email protected] In this paper, using the concepts of field theory and potential functions a sub-optimal non-parametric algorithm for clustering of convex and non-convex da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1965
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1965.15.267